Some Necessary and Some Sufficient Trace Inequalities for Euclidean Distance Matrices
نویسندگان
چکیده
In this paper, we use known bounds on the smallest eigenvalue of a symmetric matrix and Schoenberg’s Theorem to provide both necessary as well as sufficient trace inequalities that guarantee a matrix D is a Euclidean distance matrix, EDM. We also provide necessary and sufficient trace inequalities that guarantee a matrix D is an EDM generated by a regular figure.
منابع مشابه
A note on the Young type inequalities
In this paper, we present some refinements of the famous Young type inequality. As application of our result, we obtain some matrix inequalities for the Hilbert-Schmidt norm and the trace norm. The results obtained in this paper can be viewed as refinement of the derived results by H. Kai [Young type inequalities for matrices, J. Ea...
متن کاملSingular value inequalities for positive semidefinite matrices
In this note, we obtain some singular values inequalities for positive semidefinite matrices by using block matrix technique. Our results are similar to some inequalities shown by Bhatia and Kittaneh in [Linear Algebra Appl. 308 (2000) 203-211] and [Linear Algebra Appl. 428 (2008) 2177-2191].
متن کاملFurther inequalities for operator space numerical radius on 2*2 operator matrices
We present some inequalities for operator space numerical radius of $2times 2$ block matrices on the matrix space $mathcal{M}_n(X)$, when $X$ is a numerical radius operator space. These inequalities contain some upper and lower bounds for operator space numerical radius.
متن کاملCartesian decomposition of matrices and some norm inequalities
Let X be an n-square complex matrix with the Cartesian decomposition X = A + i B, where A and B are n times n Hermitian matrices. It is known that $Vert X Vert_p^2 leq 2(Vert A Vert_p^2 + Vert B Vert_p^2)$, where $p geq 2$ and $Vert . Vert_p$ is the Schatten p-norm. In this paper, this inequality and some of its improvements ...
متن کاملOn Symmetry of Some Nano Structures
It is necessary to generate the automorphism group of a chemical graph in computer-aided structure elucidation. An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for i≠j, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce...
متن کامل